Transplendent Models: Expansions Omitting a Type
نویسندگان
چکیده
منابع مشابه
Transplendent Models: Expansions Omitting a Type
We expand the notion of resplendency to theories of the kind T + p↑, where T is a first-order theory and p↑ expresses that the type p is omitted. We investigate two different formulations and prove necessary and sufficient conditions for countable recursively saturated models of PA. Some of the results in this paper can be found in one of the author’s doctoral thesis [3].
متن کاملForcing and the Omitting Type Theorem, institutionally
In the context of proliferation of many logical systems in the area of mathematical logic and computer science, we present a generalization of forcing in institution-independent model theory which is used to prove an abstract Omitting Types Theorem (OTT). We instantiate this general result to many first-order logics, which are, roughly speaking, logics whose sentences can be constructed from at...
متن کاملThe Atomic Model Theorem and Type Omitting
We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA0, and others are equivalent to ACA0. One, that every atomic theory has an atomic model, is not provable in RCA0 but is incomparable with WKL0, more than Π1 conservative over RCA0 and strictly weaker than all the combinatorial principles of Hirsch...
متن کاملTHESIS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Expansions, omitting types, and standard systems
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed. In this thesis we give further examples of variations of recursive saturation, all of which are connected with expandability properties similar to resplende...
متن کاملA New Omitting Types Theorem
An omitting types theorem for countable models of superstable theories containing an infinite set of indiscernibles is proved. Various corollaries and applications are given. 1. One of the most useful ways that the model theorist has for controlling models is to attempt to specify the element types that models realize and omit. In this paper we present an omitting types theorem which seems well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2012
ISSN: 0029-4527
DOI: 10.1215/00294527-1716739